package leetcode_501_600;

public class LeeCode_577 {
    public static void main(String[] args) {

    }
    public int maxCount(int m, int n, int[][] ops) {
        if (ops.length == 0)
            return m * n;
        int mina = Integer.MAX_VALUE;
        int minb = Integer.MAX_VALUE;
        for (int[] op : ops) {
            mina = Math.min(mina, op[0]);
            minb = Math.min(minb, op[1]);
        }
        return mina * minb;
    }
}
